Combinatorial evaluations of the Tutte polynomial
نویسندگان
چکیده
The Tutte polynomial is one of the most important and most useful invariants of a graph. It was discovered as a two variable generalization of the chromatic polynomial [15, 16], and has been studied in literally hundreds of papers, in part due to its connections to various fields ranging from Enumerative Combinatorics to Knot Theory, from Statistical Physics to Computer Science. We refer the reader to [3] for a nice introduction to the subject and to [18] for a well written and extensive survey of modern theory and applications. The main subject of this paper is combinatorial evaluations of the Tutte polynomial, by which we mean combinatorial interpretations of its values. The reader may recall classical evaluations in terms of the number of proper (vertex) colorings, spanning trees, spanning subgraphs, acyclic orientations, etc. We show that when the graph is planar, certain other values of the Tutte polynomial have a number of combinatorial interpretations specific to the plane embedding. We give new combinatorial evaluations in terms of two different edge colorings, claw coverings, and, for particular graphs on a square grid, in terms of Wang tilings and T-tetromino tilings. It is natural to ask which of our constructions extend to nonplanar graphs, in a situation when the graph is embedded into a surface of higher genus. We discover that natural generalizations of our results give combinatorial evaluations not of the Tutte polynomial, but of a specialization of a recently introduced Bollobás-Riordan polynomial [4, 5]. We should mention here that there are certain limitations of this approach; many, but not all of our results extend to that case. This paper is a sequel to our previous work [10], but can be read independently as it does not use any of our previous results. In fact, the paper is completely self-contained. Basically, in [10] we found an unexpected connection between the number of T-tetromino tilings of rectangular shape regions and the evaluation of the Tutte polynomial at (3, 3). Here we undertake a thorough investigation of this phenomenon, and explain it by a series of bijections and combinatorial evaluations. One can view this paper as a generalization of the results in [10] presented in a different language and with a philosophy opposite to
منابع مشابه
Tutte polynomials of wheels via generating functions
We find an explicit expression of the Tutte polynomial of an $n$-fan. We also find a formula of the Tutte polynomial of an $n$-wheel in terms of the Tutte polynomial of $n$-fans. Finally, we give an alternative expression of the Tutte polynomial of an $n$-wheel and then prove the explicit formula for the Tutte polynomial of an $n$-wheel.
متن کاملEhrhart theory, modular flow reciprocity, and the Tutte polynomial
Given an oriented graph G, the modular flow polynomial φG(k) counts the number of nowhere-zero Zk-flows of G. We give a description of the modular flow polynomial in terms of (open) Ehrhart polynomials of lattice polytopes. Using Ehrhart–Macdonald reciprocity we give a combinatorial interpretation for the values of φG at negative arguments which answers a question of Beck and Zaslavsky (Adv Mat...
متن کاملIdentities for circuit partition polynomials , with applications to the Tutte polynomial
The Martin polynomials, introduced by Martin in his 1977 thesis, encode information about the families of circuits in Eulerian graphs and digraphs. The circuit partition polynomials, J (G;x) and j ( G;x), are simple transformations of the Martin polynomials. We give new identities for these polynomials, analogous to Tutte’s identity for the chromatic polynomial. Following a useful expansion of ...
متن کاملThe Number of 0-1-2 Increasing Trees as Two Different Evaluations of the Tutte Polynomial of a Complete Graph
If Tn(x, y) is the Tutte polynomial of the complete graph Kn, we have the equality Tn+1(1, 0) = Tn(2, 0). This has an almost trivial proof with the right combinatorial interpretation of Tn(1, 0) and Tn(2, 0). We present an algebraic proof of a result with the same flavour as the latter: Tn+2(1,−1) = Tn(2,−1), where Tn(1,−1) has the combinatorial interpretation of being the number of 0–1–2 incre...
متن کاملOn the tutte polynomial of benzenoid chains
The Tutte polynomial of a graph G, T(G, x,y) is a polynomial in two variables defined for every undirected graph contains information about how the graph is connected. In this paper a simple formula for computing Tutte polynomial of a benzenoid chain is presented.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003